Privately Computing Set-Union and Set-Intersection Cardinality via Bloom Filters
نویسندگان
چکیده
In this paper we propose a new approach to privately compute the set-union cardinality and the set-intersection cardinality among multiple honest-but-curious parties. Our approach is inspired by a proposal of Ashok and Mukkamala (DBSec’14) which deploys Bloom filters to approximate the size tightly. One advantage of their solution is that it avoids ample public-key cryptography. Unfortunately, we show here that their protocol is vulnerable to actual attacks. We therefore propose a new Bloom filter based protocol, also forgoing heavy cryptography, and prove its security.
منابع مشابه
Fast Private Set Operations with SEPIA
Private set operations allow correlation of sensitive data from multiple data owners. Although intensely researched, current solutions still exhibit limited scalability in terms of the supported maximum set size and number of sets. To address these issues, we propose a new approach to private set operations based on a combination of efficient secure multiparty computation and bloom filters, a s...
متن کاملFast and Private Computation of Cardinality of Set Intersection and Union
With massive amounts of electronic information stored, transferred, and shared every day, legitimate needs for sensitive information must be reconciled with natural privacy concerns. This motivates various cryptographic techniques for privacy-preserving information sharing, such as Private Set Intersection (PSI) and Private Set Union (PSU). Such techniques involve two parties – client and serve...
متن کاملAn E cient Toolkit for Computing Private Set Operations
Private set operation (PSO) protocols provide a natural way of securely performing operations on data sets, such that crucial details of the input sets are not revealed. Such protocols have an everincreasing number of practical applications, particularly when implementing privacy-preserving data mining schemes. Protocols for computing private set operations have been prevalent in multi-party co...
متن کاملUnderstanding and Improving Bloom Filter Configuration for Lazy Address-Set Disambiguation
Understanding and Improving Bloom Filter Configuration for Lazy Address-Set Disambiguation Mark C. Jeffrey Master of Applied Science Graduate Department of Electrical and Computer Engineering University of Toronto 2011 Many parallelization systems detect memory access conflicts across concurrent threads by disambiguating address-sets using bit-vector-based Bloom filters, which are efficient, bu...
متن کاملComputing Private Set Operations with Linear Complexities
Private set operation (PSO) protocols provide a natural way of securely performing operations on data sets, such that crucial details of the input sets are not revealed. Such protocols have an everincreasing number of practical applications, particularly when implementing privacy-preserving data mining schemes. Protocols for computing private set operations have been prevalent in multi-party co...
متن کامل